/**
 * 定义二叉树
 */

function treeNode(val,left,right) {
    this.val = (val===undefined ? 0 : val)
    this.left = (left===undefined ? null : left)
    this.right = (right===undefined ? null : right)
}

function treeList(){
    this.head = new treeNode()
}